Research on Public Transit Network Hierarchy Based on Residential Transit Trip Distance

Public Transit Network Hierarchy Based on Residential Transit Trip Distance

To the problem of being lack of transit network hierarchy theory, a research on public transit network hierarchy optimization based on residential transit trip distance is conducted. Firstly, the hierarchy standard of transit network is given, in addition, both simulating electron cloud model and Rayleigh distribution model are used to fit the residential transit trip distance. Secondly, from t...

Trip-Based Public Transit Routing

We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a pre...

Trip-Based Public Transit Routing Using Condensed Search Trees

We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model [26] focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique ...

Improved Public Transit Improved Public Transit

Interoperable Transit Trip Planning Services

Transportation planning research has been fundamentally transformed by the advancement of spatial cyberinfrastructure (CI) and other planning information technologies. This is no better exemplified than by the evolution of online transit trip planning systems. This paper describes the progression of online transit trip planning systems as a result of innovations in cyberinfrastructure, from the...